Sankey Arcs - Visualizing edge weights in path graphs
نویسندگان
چکیده
Arc diagrams allow exploring relations and their strength between sequential nodes. Previous solutions suffer from displaying all arcs at the center of a node, which can lead to visual obstruction. We present a new technique, which extends the arc diagram technique by laying out the weighted edges of a node adjacent to each other. The aim of our Sankey Arc technique is to improve clarity, to enable users perceiving and comparing weighted edges in path graphs. The technique is illustrated using a dataset on travel paths in a public transit network.
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملThe Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
Given an edge-weighted undirected graph and two vertices s and t, the next-to-shortest path problem is to find an st-path whose length is minimum among all st-paths of lengths strictly larger than the shortest path length. The problem is shown to be polynomially solvable if all edge weights are positive, while the complexity status for the nonnegative weight case was open. In this paper we show...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملEconomical Graph Discovery
Consider a weighted n-vertex, m-edge graph G with designated source s and destination t. The topology of G is known, while the edge weights are hidden. Our goal is to discover either the edge weights in the graph or a shortest (s, t)-path. This is done by means of agents that traverse different (s, t)-paths in multiple rounds and report back the total cost they incurred. Various cost models are...
متن کامل